Combinatorial Landscapes
نویسندگان
چکیده
Fitness landscapes have proven to be a valuable concept in evolutionary biology, combinatorial optimization, and the physics of disordered systems. A fitness landscape is a mapping from a configuration space into the real numbers. The configuration space is equipped with some notion of adjacency, nearness, distance or accessibility. Landscape theory has emerged as an attempt to devise suitable mathematical structures for describing the “static” properties of landscapes as well as their influence on the dynamics of adaptation. In this review we focus on the connections of landscape theory with algebraic combinatorics and random graph theory, where exact results are available.
منابع مشابه
Climbing Combinatorial Fitness Landscapes
Résumé en anglais Hill-climbing constitutes one of the simplest way to produce approximate solutions of a combinatorial optimization problem, and is a central component of most advanced metaheuristics. This paper focuses on evaluating climbing techniques in a context where deteriorating moves are not allowed, in order to isolate the intensification aspect of metaheuristics. We aim at providing ...
متن کاملFitness Landscapes
Fitness landscapes are a valuable concept in evolutionary biology, combinatorial optimization, and the physics of disordered systems. A fitness landscape is a mapping from a configuration space that is equipped with some notion of adjacency, nearness, distance or accessibility, into the real numbers. Landscape theory has emerged as an attempt to devise suitable mathematical structures for descr...
متن کاملFitness Landscapes and Memetic Algorithm Design 3.1 Introduction 3.2 Fitness Landscapes of Combinatorial Problems
The notion of tness landscapes has been introduced to describe the dynamics of evolutionary adaptation in nature 40] and has become a powerful concept in evolutionary theory. Fitness landscapes are equally well suited to describe the behavior of heuristic search methods in optimization, since the process of evolution can be thought of as searching a collection of genotypes in order to nd the ge...
متن کاملLocal Optima Networks: A New Model of Combinatorial Fitness Landscapes
This chapter overviews a recently introduced network-based model of combinatorial landscapes: Local Optima Networks (LON). The model compresses the information given by the whole search space into a smaller mathematical object that is a graph having as vertices the local optima and as edges the possible weighted transitions between them. Two definitions of edges have been proposed: basin-transi...
متن کاملA Methodology to Find the Elementary Landscape Decomposition of Combinatorial Optimization Problems
A small number of combinatorial optimization problems have search spaces that correspond to elementary landscapes, where the objective function f is an eigenfunction of the Laplacian that describes the neighborhood structure of the search space. Many problems are not elementary; however, the objective function of a combinatorial optimization problem can always be expressed as a superposition of...
متن کاملDiscrete Optimization and Data Analysis: An Empirical Approach to Landscapes
Metaheuristics for discrete optimization can be thought of as dynamics on combinatorial landscapes, i.e., discrete energy landscapes. Since the features of a landscape determine the performance of a search algorithm, landscape analysis is a key tool in the selection and tuning of metaheuristics. While landscapes have been analyzed in this context, we believe there is room for further synthesis....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM Review
دوره 44 شماره
صفحات -
تاریخ انتشار 2002